A Concept of Effectively Global Search and a Global Adaptation Strategy for Local Search Heuristics
نویسندگان
چکیده
منابع مشابه
Improved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملimproved cuckoo search algorithm for global optimization
the cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. to enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. normally, the parametersof the cuckoo search are kept constant. this may lead todecreasing the efficiency of the algorithm. to cop...
متن کاملOptimizing Global-Local Search Hybrids
This paper develops a framework for optimizing global-local hybrids of search or optimization procedures. The paper starts by idealizing the search problem as a search by a global algorithm G for either (1) acceptable targets|solutions that meet a speci ed criterion|or for (2) basins of attraction that then lead to acceptable targets under a speci ed local search algorithm L. The paper continue...
متن کاملUsing global constraints for local search
Conventional ways of using local search are di cult to generalize Increased e ciency is the only goal generality often being disregarded This is manifested in the highly monolithic encodings of complex problems and the application of highly speci c satisfaction methods Other approaches take the general constraint programming framework as a starting point and try to introduce local search method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 2004
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.70.2171